Integrating ProB into the TLA Toolbox
نویسندگان
چکیده
Features. Animation is one of the most useful features of ProB that is not currently supported by the TLAtool chain. It allows a user to interact with the specification by discovering the statespace step by step and to evaluate expressions on the current state. Animation could be especially useful for newcomers to get familiar with TLA. Moreover, the ProB animator can be used to control a graphical visualization of a specification (top right view in Fig. 1). Apart from that, ProB is a model checker complementary to TLC. Experimental results comparing both model checkers can be found in [3]. Another useful feature of ProB is called constrained based model checking. In this mode of operation, ProB does not explore all reachable states starting from the initial state(s), but checks whether a single step of the next-state relation can result in an invariant violation
منابع مشابه
Translating TLA + to B for Validation with ProB
TLA and B share the common base of predicate logic, arithmetic and set theory. However, there are still considerable differences, such as very different approaches to typing and modularization. There is also considerable difference in the available tool support. In this paper, we present a translation of the non-temporal part of TLA to B, which makes it possible to feed TLA specifications into ...
متن کاملValidating B, Z and TLA + Using ProB and Kodkod
We present the integration of the Kodkod high-level interface to SAT-solvers into the kernel of ProB. As such, predicates from B, Event-B, Z and TLA can be solved using a mixture of SAT-solving and ProB’s own constraint-solving capabilities developed using constraint logic programming: the first-order parts which can be dealt with by Kodkod and the remaining parts solved by the existing ProB ke...
متن کاملTranslating B to TLA + for Validation with TLC
The state-based formal methods B and TLA share the common base of predicate logic, arithmetic and set theory. However, there are still considerable differences, such as the way to specify state transitions, the different approaches to typing, and the available tool support. In this paper, we present a translation from B to TLA to validate B specifications using the model checker TLC. The transl...
متن کاملOptimising the ProB Model Checker for B using Partial Order Reduction (technical report)
Partial order reduction has been very successful at combatting the state explosion problem [4, 11] for lower-level formalisms, but has thus far made hardly any impact for model checking higher-level formalisms such as B, Z or TLA. This paper attempts to remedy this issue in the context of the increasing importance of Event-B, with its much more fine-grained events and thus increased potential f...
متن کاملTLA + Proofs
TLA is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA proofs and check them with TLAPS, the TLA Proof System. We use Peterson’s mutual exclusion algorithm as a simple example to describe the features of TLAPS and show how it and the Toolbox (an IDE for TLA) help users to manage large, complex pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014